Inverse eigenvalue problems linked to rational Arnoldi, and rational nonsymmetric Lanczos
نویسندگان
چکیده
Two inverse eigenvalue problems are discussed. First, given the eigenvalues and a weight vector an extended Hessenberg matrix is computed. This matrix represents the recurrences linked to a (rational) Arnoldi inverse problem. It is well-known that the matrix capturing the recurrence coefficients is of Hessenberg form in the standard Arnoldi case. Considering, however, rational functions and admitting finite as well as infinite poles we will prove that the recurrence matrix is still of a highly structured form – the extended Hessenberg form. An efficient memory-economical representation is proposed and used to reconstruct the matrix capturing the recurrence coefficients. In the second inverse eigenvalue problem, the above setting is generalized to the biorthogonal case: unitarity is dropped in the similarity transformations. Given the eigenvalues and the first component of each left eigenvector and each right eigenvector we want to retrieve the matrix of recurrences as well as the matrices governing the transformation.
منابع مشابه
Implicitly Restarted Arnoldi/lanczos Methods for Large Scale Eigenvalue Calculations
This report provides an introductory overview of the numerical solution of large scale algebraic eigenvalue problems. The main focus is on a class of methods called Krylov subspace projection methods. The Lanczos method is the premier member of this class and the Arnoldi method is a generalization to the nonsymmetric case. A recently developed and very promising variant of the Arnoldi/Lanczos s...
متن کاملRational Krylov for Large Nonlinear Eigenproblems
Rational Krylov is an extension of the Lanczos or Arnoldi eigenvalue algorithm where several shifts (matrix factorizations) are used in one run. It corresponds to multipoint moment matching in model reduction. A variant applicable to nonlinear eigenproblems is described.
متن کاملRational Krylov Algorithms for Eigenvalue Computation and Model Reduction
Rational Krylov is an extension of the Lanczos or Arnoldi eigenvalue algorithm where several shifts (matrix factorizations) are performed in one run. A variant has been developed, where these factoriza-tions are performed in parallel. It is shown how Rational Krylov can be used to nd a reduced order model of a large linear dynamical system. In Electrical Engineering, it is important that the re...
متن کاملAn Arnoldi Method for Nonlinear Symmetric Eigenvalue Problems
where T (λ) ∈ R is a family of symmetric matrices depending on a parameter λ ∈ J , and J ⊂ R is an open interval which may be unbounded. As in the linear case T (λ) = λI −A a parameter λ is called an eigenvalue of T (·) if problem (1) has a nontrivial solution x 6= 0 which is called a corresponding eigenvector. We assume that the matrices T (λ) are large and sparse. For sparse linear eigenvalue...
متن کاملAn Arnoldi Method for Nonlinear Eigenvalue Problems
For the nonlinear eigenvalue problem T (λ)x = 0 we propose an iterative projection method for computing a few eigenvalues close to a given parameter. The current search space is expanded by a generalization of the shift-and-invert Arnoldi method. The resulting projected eigenproblems of small dimension are solved by inverse iteration. The method is applied to a rational eigenvalue problem gover...
متن کامل